<<<<<<< HEAD
public class Test {

    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        /*为什么不是BinaryTree.TreeNode root = binaryTree.TreeNode();
        或者 binaryTree.TreeNode root = binaryTree.createTree();
        或者 binaryTree.createTree root = binaryTree.createTree();
        或者 binaryTree.TreeNode root = binaryTree.TreeNode();*/
        BinaryTree.TreeNode root = binaryTree.createTree();
        BinaryTree.TreeNode subRoot = binaryTree.createTree1();

        binaryTree.preOrder(root);
        System.out.println();
        binaryTree.inOrder(root);
        System.out.println();
        binaryTree.postOrder(root);
        System.out.println();
        System.out.println(binaryTree.getNoteSize1(root));
        System.out.println(binaryTree.getNoteSize2(root));
        System.out.println(binaryTree.getLeafNodeCount1(root));
        System.out.println(binaryTree.getLeafNodeCount2(root));
        System.out.println(binaryTree.getKLevelNodeCount(root, 3));
        System.out.println(binaryTree.getHeight(root));
        System.out.println("检测值为value的元素是否存在");
        System.out.println(binaryTree.find(root, 'F').val);

        System.out.println(binaryTree.isSubtree(root, subRoot));
        binaryTree.levelOrder1(root);
    }
}
=======
public class Test {

    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        /*为什么不是BinaryTree.TreeNode root = binaryTree.TreeNode();
        或者 binaryTree.TreeNode root = binaryTree.createTree();
        或者 binaryTree.createTree root = binaryTree.createTree();
        或者 binaryTree.TreeNode root = binaryTree.TreeNode();*/
        BinaryTree.TreeNode root = binaryTree.createTree();
        BinaryTree.TreeNode subRoot = binaryTree.createTree1();

        binaryTree.preOrder(root);
        System.out.println();
        binaryTree.inOrder(root);
        System.out.println();
        binaryTree.postOrder(root);
        System.out.println();
        System.out.println(binaryTree.getNoteSize1(root));
        System.out.println(binaryTree.getNoteSize2(root));
        System.out.println(binaryTree.getLeafNodeCount1(root));
        System.out.println(binaryTree.getLeafNodeCount2(root));
        System.out.println(binaryTree.getKLevelNodeCount(root, 3));
        System.out.println(binaryTree.getHeight(root));
        System.out.println("检测值为value的元素是否存在");
        System.out.println(binaryTree.find(root, 'F').val);

        System.out.println(binaryTree.isSubtree(root, subRoot));
        binaryTree.levelOrder1(root);
    }
}
>>>>>>> 910c449b2d9609f5488fada51d1fca89c0904e69
